On the Capacity Region of Multiple Access Adder Channel
نویسنده
چکیده
The model of communication is as follows (see Fig. 1). Each user i chooses a label mi uniformly from its message set [Mi] and sends the codeword ei(mi). All the users send their codewords simultaneously, symbol by symbol. After n transmissions, a sequence of n output symbols (y1, y2, . . . , yn) is received according to the transition probability matrix. This is then decoded by the decoding function d into a set of messages (m̂1, . . . , m̂s). If the decoded messages are identical to the messages sent, the communication has succeeded. Otherwise, we say an error has occurred.
منابع مشابه
Extension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملOn the capacity region of the discrete additive multiple-access arbitrarily varying channel
The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...
متن کاملClassical Capacity of Quantum Binary Adder Channels
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well–studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the general theory of quantum multiple access channels, and we may apply the established formulas for the capacity region to it. However, the binary adder chann...
متن کاملA Bound on the Financial Value of Information The strong law of large numbers for products yields
The noiseless coding problem is considered for a recentlyintroduced discrete memoryless multiple-access channel that is a counter-part to the well-known binary adder channel. Upper and lower bounds onthe number of codewords in a uniquely decodable code pair are given, fromwhich the zero-error capacity region of this channel is derived. This regioncoincides with the classical...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملOn the Capacity Region of Multiple Access Channel
The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.
متن کامل